A simplification functor for coalgebras

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A simplification functor for coalgebras

For an arbitrary-type functor F, the notion of split coalgebras, that is, coalgebras for which the canonical projections onto the simple factor split, generalizes the well-known notion of simple coalgebras. In case F weakly preserves kernels, the passage from a coalgebra to its simple factor is functorial. This is the simplification functor. It is left adjoint to the inclusion of the subcategor...

متن کامل

On descent for coalgebras and type transformations

We find a criterion for a morphism of coalgebras over a Barr-exact category to be effective descent and determine (effective) descent morphisms for coalgebras over toposes in some cases. Also, we study some exactness properties of endofunctors of arbitrary categories in connection with natural transformations between them as well as those of functors that these transformations induce between co...

متن کامل

A Geometric Jacquet Functor

In the paper [BB1], Beilinson and Bernstein used the method of localisation to give a new proof and generalisation of Casselman’s subrepresentation theorem. The key point is to interpret n-homology in geometric terms. The object of this note is to go one step further and describe the Jacquet module functor on Harish-Chandra modules via geometry. Let GR be a real reductive linear algebraic group...

متن کامل

A Completion Functor for Cauchy Groups

A completion functor is constructed on the category of completely normal Cauchy groups and Cauchy-continuous homomorphlsms. A competlon functor is also obtained for a corresponding category of convergence groups.

متن کامل

Translating Logics for Coalgebras

This paper shows, that three di erent types of logics for coalgebras are institutions. The logics di er regarding the presentation of their syntax. In the rst framework, abstract behavioural logic, one has a syntax-free representation of behavioural properties. We then turn to coalgebraic logic, the syntax of which is given as an initial algebra. The last framework, which we consider, is coalge...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences

سال: 2006

ISSN: 0161-1712,1687-0425

DOI: 10.1155/ijmms/2006/56786